New Hardness Tester for Super Low Hardness Specimen.
نویسندگان
چکیده
منابع مشابه
A New Grain Hardness Tester
.\ hardness tester, especially adapted for grain, was cor~structecl by modifying a commercial portable soft metal tester known as the Barcol Impressor. h preloaded stylus is forced into grain sections preparetl by rneans ot a microtome. The displacement of the stylus, nleasured by a dial micrometer, is used as a hardness index. This has been related to tlie l'ickers tlianlontl pyramid hardness ...
متن کاملWorst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-Offs
Up to now, the known derandomization methods for BPP have been derived assuming the existence of an ExP function that has a "hard" average-case circuit complexity. In this paper we instead present the first construction of a de-randomization method for BOP that relies on the existence of an EXP function that is hard only in the worst-case. The construction is based on a new method that departs ...
متن کاملAccuracy of Standard Blocks for Hardness and Uncertainty of Hardness
− The authors numerically discuss the accuracy of the hardness values of standard hardness blocks by evaluating the uniformity of hardness blocks and the resolution of hardness values according to test method. As a result of reviewing the results of this evaluation and the reasonability of the currently proposed method for evaluating the uncertainty of hardness values, it is revealed that the v...
متن کاملLow-Load Vickers Microindentation Hardness Testing
ADVANCED MATERIALS & PROCESSES • APRIL 2012 I n 1925 in the UK, Smith and Sandland developed an indentation test that used a squarebased pyramidal-shaped indenter made of diamond[1]. The test was developed because the Brinell test (introduced in 1900), which (until recently) used a round hardened steel ball indenter, could not test steels harder than ~450 HB (~48 HRC). They chose this shape wit...
متن کاملHardness for Hypergraph Coloring
We show that it is quasi-NP-hard to color 2-colorable 8-uniform hypergraphs with 2(logN) 1/10−o(1) colors, where N is the number of vertices. There has been much focus on hardness of hypergraph coloring recently. In [17], Guruswami, H̊astad, Harsha, Srinivasan and Varma showed that it is quasi-NP-hard to color 2-colorable 8-uniform hypergraphs with 22Ω( √ log logN) colors. Their result is obtain...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: NIPPON GOMU KYOKAISHI
سال: 1996
ISSN: 1884-0442,0029-022X
DOI: 10.2324/gomu.69.516